Hohmann transfer via constrained optimization
نویسندگان
چکیده
منابع مشابه
Hohmann Transfer via Constrained Optimization
In the first part of this paper, inspired by the geometric method of Jean-Pierre Marec, we consider the two-impulse Hohmann transfer problem between two coplanar circular orbits as a constrained nonlinear programming problem. By using the Kuhn-Tucker theorem, we analytically prove the global optimality of the Hohmann transfer. Two sets of feasible solutions are found, one of which corresponding...
متن کاملConstrained Discrete Optimization via Dual Space Search
This paper proposes a novel algorithm for solving NP-hard constrained discrete minimization problems whose unconstrained versions are solvable in polynomial time such as constrained submodular function minimization. Applications of our algorithm include constrained MAP inference in Markov Random Fields, and energy minimization in various computer vision problems. Our algorithm assumes the exist...
متن کاملChance constrained uncertain classification via robust optimization
This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain datapoints are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as ...
متن کاملParallelization via Constrained Storage Mapping Optimization
A key problem for parallelizing compilers is to nd the good tradeo between memory expansion and parallelism. This paper is a new step towards solving this problem. A framework for parallel execution order and storage mapping computation is designed, allowing time and space optimization. Constrained expansion|a theoretical model for expansion strategies|is shown to be very useful in this context.
متن کاملOptimal Neural Net Compression via Constrained Optimization
Compressing neural nets is an active research problem, given the large size of state-of-the-art nets for tasks such as object recognition, and the computational limits imposed by mobile devices. Firstly, we give a general formulation of model compression as constrained optimization. This makes the problem of model compression well defined and amenable to the use of modern numerical optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Information Technology & Electronic Engineering
سال: 2018
ISSN: 2095-9184,2095-9230
DOI: 10.1631/fitee.1800295